import java.util.Arrays;
import java.util.Scanner;

public class Main {


    //拼三角
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        int[] a = new int[6];
        for (int i = 0; i < t; i++) {
            for (int j = 0; j < 6; j++) {
                a[j] = in.nextInt();
            }
            Arrays.sort(a);
            if (a[0] +a[1]>a[2] && a[3]+a[4]>a[5] || a[0]+a[2]>a[3] && a[1]+a[4]>a[5]
            || a[0]+a[3]>a[4] && a[1]+a[2]>a[5] || a[0]+a[4]>a[5] && a[1] +a[2]>a[3]){
                System.out.println("Yes");
            }else{
                System.out.println("No");
            }
        }
        System.out.println();

    }



    //岛屿数量
    public void dfs(char[][] grid,int i,int j){
        int m = grid[0].length;
        int n = grid.length;
        grid[i][j] = '0';
        if (i-1>=0 && grid[i-1][j] =='1') dfs(grid,i-1,j);
        if (i+1<n && grid[i+1][j] == '1') dfs(grid,i+1,j);
        if (j-1>=0 && grid[i][j-1] == '1') dfs(grid,i,j-1);
        if (j+1<m && grid[i][j+1] == '1') dfs(grid,i,j+1);
    }
    public int solve(char[][] grid){
        int m = grid[0].length;
        int n = grid.length;
        if(n==0) return 0;
        int res = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if(grid[i][j] == '1'){
                    res++;
                    dfs(grid,i,j);
                }
            }
        }
        return res;
    }


    //字符串中找出连续最长的数字串
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        String str = in.nextLine();
        String str1 = "";
        String str2 = "";
        int i = 0;
        for (; i < str.length(); i++) {
            if (str.charAt(i) >='0' && str.charAt(i)<='9'){
                str1 = str1+str.charAt(i)+"";
            }else{
                if (str1.length()>str2.length()){
                    str2 = str1;
                }
                str1 = "";
            }
        }
        if (i == str.length() && str1.length()>str2.length()) {
            str2 = str1;
        }
        System.out.println(str2);
    }
}
